Towards mechanized correctness proofs for cryptographic algorithms
نویسندگان
چکیده
منابع مشابه
Towards mechanized correctness proofs for cryptographic algorithms: Axiomatization of a probabilistic Hoare style logic
In [5] we build a formal verification technique for game based correctness proofs of cryptograhic algorithms based on a probabilistic Hoare style logic [10]. An important step towards enabling mechanized verification within this technique is an axiomatization of implication between predicates which is purely semantically defined in [10]. In this paper we provide an axiomatization and illustrate...
متن کاملHierarchical Correctness Proofs for Distributed Algorithms Hierarchical Correctness Proofs for Distributed Algorithms
This thesis introduces a new model for distributed computation in asynchronous net works the input output automaton This simple powerful model captures in a novel way the game theoretic interaction between a system and its environment and allows funda mental properties of distributed computation such as fair computation to be naturally expressed Furthermore this model can be used to construct m...
متن کاملFunctional Correctness Proofs of Encryption Algorithms
We discuss a collection of mechanized formal proofs of symmetric key block encryption algorithms (AES, MARS, Twofish, RC6, Serpent, IDEA, and TEA), performed in an implementation of higher order logic. For each algorithm, functional correctness, namely that decryption inverts encryption, is formally proved by a simple but effective proof methodology involving application of invertibility lemmas...
متن کاملDecomposing Correctness Proofs of Fault-Tolerant Algorithms
Proving the correctness of fault-tolerant algorithms is a tedious endeavor. Not only are the algorithms themselves complex, but nondeterministic fault transitions due to the environment compound the complexity. We demonstrate how to systematically decompose proofs of correctness. We first define a relation between the execution of an algorithm in a fault-generating environment and a fault-free ...
متن کاملTowards Practical Proofs of Class Correctness
1 SCOPE " Trusted Components " are reusable software elements with guaranteed quality properties. Establishing a base of trusted components is among the most promising approaches to improving the general state of software; the potential for widespread reuse justifies the effort necessary to get the components right [11]. The most ambitious guarantee of component properties is a mathematical pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2008
ISSN: 0167-6423
DOI: 10.1016/j.scico.2008.09.006